@InProceedings{NobleSchAgoAraLam:2011:TwNoAl,
               author = "Noble, Diego Vrague and Schiavon Porto, Marcelo and Agostini, 
                         Luciano Volcan and Ara{\'u}jo, Ricardo Matsumura and Lamb, Luis 
                         da Cunha",
          affiliation = "{Federal University of Rio Grande do Sul} and {Federal University 
                         of Pelotas} and {Federal University of Pelotas} and {Federal 
                         University of Pelotas} and {Federal University of Rio Grande do 
                         Sul}",
                title = "Two Novel Algorithms for High Quality Motion Estimation in High 
                         Definition Video Sequences",
            booktitle = "Proceedings...",
                 year = "2011",
               editor = "Lewiner, Thomas and Torres, Ricardo",
         organization = "Conference on Graphics, Patterns and Images, 24. (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
             keywords = "motion estimation, video coding, high definition.",
             abstract = "In this paper, we propose two new algorithms for high quality 
                         motion estimation in high definition digital videos. Both 
                         algorithms are based on the use of random features that guarantee 
                         robustness to avoid dropping into a local-minimum. The first 
                         algorithm was developed from a simple two stage approach where a 
                         random stage is complemented by a greedy stage in a very simple 
                         fashion. The second algorithm is based on a more refined class of 
                         algorithms called Memetic Network Algorithms where each instance 
                         of the search may exchange information with its neighbour 
                         instances according to some rules that control the information 
                         flow. The proposed algorithms were implemented and tested 
                         exclusively with high definition sequences against well known fast 
                         algorithms like Diamond Search and Three Step Search. The results 
                         show that our algorithms can outperform other algorithms in 
                         quality yielding an increment in complexity that may be amortized 
                         if resources for a parallel execution are available. Additionally, 
                         we provide further evidence that fast algorithms do not perform 
                         well in high definition.",
  conference-location = "Macei{\'o}, AL, Brazil",
      conference-year = "28-31 Aug. 2011",
                  doi = "10.1109/SIBGRAPI.2011.42",
                  url = "http://dx.doi.org/10.1109/SIBGRAPI.2011.42",
             language = "en",
                  ibi = "8JMKD3MGPBW34M/3A3EFJB",
                  url = "http://urlib.net/ibi/8JMKD3MGPBW34M/3A3EFJB",
           targetfile = "87108_2.pdf",
        urlaccessdate = "2024, Apr. 28"
}